Distributed Stochastic Consensus Optimization Using Communication-Censoring Strategy

نویسندگان

چکیده

In this paper, a novel communication-efficient distributed stochastic algorithm (referred as CO-DSA) is proposed for solving large-scale consensus optimization problems. As compared to the existing relevant work where only sublinear convergence rate obtained strongly convex and smooth objective functions, CO-DSA achieves linear even in presence of an event-triggered based communication-censoring strategy. Moreover, by properly setting threshold function communication scheme, maintains same without communication. This means theoretically yields efficiency free. Numerical experiments verify theoretical findings also show excellent saving effect large networks.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Communication/Computation Tradeoffs in Consensus-Based Distributed Optimization

We study the scalability of consensus-based distributed optimization algorithms by considering two questions: How many processors should we use for a given problem, and how often should they communicate when communication is not free? Central to our analysis is a problem-specific value r which quantifies the communication/computation tradeoff. We show that organizing the communication among nod...

متن کامل

Distributed Time-Varying Stochastic Optimization and Utility-Based Communication

We devise a distributed asynchronous stochastic ǫgradient-based algorithm to enable a network of computing and communicating nodes to solve a constrained discrete-time time-varying stochastic convex optimization problem. Each node updates its own decision variable only once every discrete time step. Under some assumptions (among which, strong convexity, Lipschitz continuity of the gradient, per...

متن کامل

Memory and Communication Efficient Distributed Stochastic Optimization with Minibatch Prox

We present and analyze statistically optimal, communication and memory efficient distributed stochastic optimization algorithms with near-linear speedups (up to log-factors). This improves over prior work which includes methods with near-linear speedups but polynomial communication requirements (accelerated minibatch SGD) and communication efficient methods which do not exhibit any runtime spee...

متن کامل

Passivity-Based Distributed Optimization with Communication Delays Using PI Consensus Algorithm

In this paper, we address a class of distributed optimization problems in the presence of inter-agent communication delays based on passivity. We first focus on unconstrained distributed optimization and provide a passivity-based perspective for distributed optimization algorithms. With the help of the scattering transformation, this perspective allows us to handle arbitrary and unknown constan...

متن کامل

Stochastic consensus seeking with communication delays

This paper investigates the consensus problem of dynamical networks of multi-agents where each agent can only obtain noisy and delayed measurements of the states of its neighbors due to environmental uncertainties and communication delays. We consider general networks with fixed topology and with switching (dynamically changing) topology, propose consensus protocols that take into account both ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Control of Network Systems

سال: 2023

ISSN: ['2325-5870', '2372-2533']

DOI: https://doi.org/10.1109/tcns.2023.3281561